Directed graphs, decompositions, and spatial linkages
نویسندگان
چکیده
منابع مشابه
Directed graphs, decompositions, and spatial linkages
The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently intominimal pinned isostatic graphs, which we call d-Assur graphs. W...
متن کاملHalf-Integral Linkages in Highly Connected Directed Graphs
We study the half-integral k-Directed Disjoint Paths Problem ( 2kDDPP) in highly strongly connected digraphs. The integral kDDPP is NP-complete even when restricted to instances where k = 2, and the input graph is L-strongly connected, for any L ≥ 1. We show that when the integrality condition is relaxed to allow each vertex to be used in two paths, the problem becomes efficiently solvable in h...
متن کاملCycle decompositions IV: complete directed graphs and fixed length directed cycles
We establish necessary and sufficient conditions for decomposing the complete symmetric digraph of order n into directed cycles of length m; where 2pmpn: r 2003 Elsevier Science (USA). All rights reserved.
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملDirected 3-cycle decompositions of complete directed graphs with quadratic leaves
Let G be a vertex-disjoint union of directed cycles in the complete directed graph Dt , let |E(G)| be the number of directed edges of G and suppose G 6= ⇀ C 2 ∪ ⇀ C 3 or ⇀ C 5 if t = 5, and G 6= ⇀ C 3 ∪ ⇀ C 3 if t = 6. It is proved in this paper that for each positive integer t , there exist ⇀ C 3-decompositions for Dt − G if and only if t(t − 1)− |E(G)| ≡ 0 (mod 3). © 2008 Elsevier B.V. All ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.06.004